On lucky ideals for Gröbner basis computations
نویسندگان
چکیده
منابع مشابه
On Gröbner Basis Detection for Zero-dimensional Ideals
The Gröbner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if “yes” finda term order such that the set of polynomials is a Gröbner basis. This problem was shown to be NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD for zero dimensiona...
متن کاملPolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modelled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x...
متن کاملOptimal Gröbner Base Algorithms for Binomial Ideals
Little is known about upper complexity bounds for the normal form algorithms which transform a given polynomial ideal basis into a Grr obner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Grr obner basis of binomial ideals. This result is then applied to derive space optimal decision procedures for the nite enumeration and subword problems fo...
متن کاملOn the universal Gröbner bases of toric ideals of graphs
To any graph G can be associated a toric ideal I G. In this talk some recent joint work with Enrique Reyes and Christos Tatakis will be presented on the toric ideal of a graph. A characterization in graph theoretical terms of the elements of the Graver basis and the universal Gröbner basis of the toric ideal of a graph will be given. The Graver basis is the union of the primitive binomials of t...
متن کاملBinomial Edge Ideals with Quadratic Gröbner Bases
We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1992
ISSN: 0747-7171
DOI: 10.1016/0747-7171(92)90018-y